Folding behaviour of Tachi–Miura polyhedron bellows
نویسندگان
چکیده
منابع مشابه
On Folding a Polygon to a Polyhedron
We show that the open problem presented in Geometric Folding Algorithms: Linkages, Origami, Polyhedra [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.
متن کاملOrigamizer: A Practical Algorithm for Folding Any Polyhedron
It was established at SoCG’99 that every polyhedral complex can be folded from a sufficiently large square of paper, but the known algorithms are extremely impractical, wasting most of the material and making folds through many layers of paper. At a deeper level, these foldings get the topology wrong, introducing many gaps (boundaries) in the surface, which results in flimsy foldings in practic...
متن کاملWhat is the Bellows Conjecture?
Cauchy’s rigidity theorem states: If P and P’ are combinatorially equivalent convex polyhedra such that the corresponding facets of P and P’ are congruent, then P and P’ are congruent polyhedra. For many years it was unknown whether the same theorem was true in general for non-convex polyhedron. In 1977, more than 160 years after the work of Cauchy, Robert Connelly discovered a polyhedron P (wi...
متن کاملUniversal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid—for example, the surface of any polycube. The folding is efficient: for target surfaces topologically equivalent to a sphere, the strip needs to have only twice the target surface area, and the folding stacks at most two layers of material anywhe...
متن کاملCharacterization of polyhedron monotonicity
The notion of polygon monotonicity has been well researched to be used as an important property for various geometric problems. This notion can be more extended for categorizing the boundary shapes of polyhedrons, but it has not been explored enough yet. This paper characterizes three types of polyhedron monotonicity: strong-, weak-, and directional-monotonicity: (Toussaint, 1985). We reexamine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2013
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2013.0351